Faster deterministic parameterized algorithm for k-Path
نویسندگان
چکیده
منابع مشابه
A faster parameterized algorithm for Pseudoforest Deletion
A pseudoforest is a graph where each connected component contains at most one cycle, or alternatively, a graph that can be turned into a forest by removing at most one edge from each connected component. In this paper, we show that the following problem can be solved in O(3knkO(1)) time: given a graph G and an integer k, can we delete at most k vertices from G such that we obtain a pseudoforest...
متن کاملA faster parameterized algorithm for set packing
We present an efficient parameterized algorithm for the (k, t)-set packing problem, in which we are looking for a collection of k disjoint sets whose union consists of t elements. The complexity of the algorithm is O(2nN log N). For the special case of sets of bounded size, this improves the O((ck)n) algorithm of Jia et al. [2004, J. Algorithms, 50(1)].
متن کاملA Faster Parameterized Algorithm for Treedepth
The width measure treedepth, also known as vertex ranking, centered coloring and elimination tree height, is a well-established notion which has recently seen a resurgence of interest. We present an algorithm which—given as input an n-vertex graph, a tree decomposition of the graph of width w, and an integer t—decides Treedepth, i.e. whether the treedepth of the graph is at most t, in time 2O(w...
متن کاملFaster FPT Algorithm for Graph Isomorphism Parameterized by Eigenvalue Multiplicity
We give a O(k) time isomorphism testing algorithm for graphs of eigenvalue multiplicity bounded by k which improves on the previous best running time bound of O(2 / log ) [EP97a].
متن کاملA Faster Parameterized Algorithm for Group Feedback Edge Set
In the Group Feedback Edge Set ( ) (Group FES( )) problem, the input is a group-labeled graph G over a group Γ of order and an integer k and the objective is to test whether there exists a set of at most k edges intersecting every non-null cycle in G. The study of the parameterized complexity of Group FES( ) was motivated by the fact that it generalizes the classical Edge Bipartization problem ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2019
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2019.04.024